Probabilistic Reasoning at Optimum Entropy with the MEcore System
نویسندگان
چکیده
Augmenting probabilities to conditional logic yields an expressive mechanism for representing uncertainty. The principle of optimum entropy allows one to reason in probabilistic logic in an information-theoretic optimal way by completing the given information as unbiasedly as possible. In this paper, we introduce the MECoRe system that realises the core functionalities for an intelligent agent reasoning at optimum entropy and that provides powerful mechanisms for belief management operations like revision, update, diagnosis, or hypothetical what-if-analysis.
منابع مشابه
Load-Frequency Control: a GA based Bayesian Networks Multi-agent System
Bayesian Networks (BN) provides a robust probabilistic method of reasoning under uncertainty. They have been successfully applied in a variety of real-world tasks but they have received little attention in the area of load-frequency control (LFC). In practice, LFC systems use proportional-integral controllers. However since these controllers are designed using a linear model, the nonlinearities...
متن کاملChanges of Relational Probabilistic Belief States and Their Computation under Optimum Entropy Semantics
Coping with uncertain knowledge and changing beliefs is essential for reasoning in dynamic environments. We generalize an approach to adjust probabilistic belief states by use of the relative entropy in a propositional setting to relational languages. As a second contribution of this paper, we present a method to compute such belief changes by considering a dual problem and present first applic...
متن کاملA Novel Methodology for Processing Probabilistic Knowledge Bases Under Maximum Entropy
Probabilistic reasoning under the so-called principle of maximum entropy is a viable and convenient alternative to Bayesian networks, relieving the user from providing complete (local) probabilistic information and observing rigorous conditional independence assumptions. In this paper, we present a novel approach to performing computational MaxEnt reasoning that makes use of symbolic computatio...
متن کاملA Logic For Inductive Probabilistic Reasoning
Inductive probabilistic reasoning is understood as the application of inference patterns that use statistical background information to assign (subjective) probabilities to single events. The simplest such inference pattern is direct inference: from “70% of As are Bs” and “a is an A” infer that a is a B with probability 0.7. Direct inference is generalized by Jeffrey’s rule and the principle of...
متن کاملThe Social Entropy Process: Axiomatising the Aggregation of Probabilistic Beliefs
The present work stems from a desire to combine ideas arising from two historically different schemes of probabilistic reasoning, each having its own axiomatic traditions, into a single broader axiomatic framework, capable of providing general new insights into the nature of probabilistic inference in a collective context. In the present sketch of our work we describe briefly the background con...
متن کامل